Dynamic table index mapping

ABSTRACT

Described are methods, systems and computer readable media for external table index mapping.

This application claims the benefit of U.S. Provisional Application No. 62/161,813, entitled “Computer Data System” and filed on May 14, 2015, which is incorporated herein by reference in its entirety.

Embodiments relate generally to computer data systems, and more particularly, to methods, systems and computer readable media for mapping a large data source index into smaller separate data source indexes that can be access more efficiently than a large data source index.

Computers are capable of managing large data sources such as large tables containing numerous columns and billions of rows. And many of these large tables can add thousands of rows of data per second. Such a system could be collecting table rows from large real-time streams of data, such as stock data feeds and the associated quotes and trades for millions of individual quotes and trades of the trading day. Users may have a need to find information in these large tables quickly, especially if a query result is needed to make a real-time decision, such as buy or sell. If the query takes too long to complete a real-time decision may not be possible and the real-time decision is downgraded to an after-the-fact decision. Users may also want to be able to display subsets of a table in a GUI and flip between the subsets of data. Further, users may want to break a table down into subtables and then be able to apply operations to the subtables with a language construct that allows easy execution.

Embodiments were conceived in light of the above mentioned needs, problems and/or limitations, among other things.

Some implementations can include a computer system for decreasing memory access and processing time in a computer system, the system comprising one or more processors, computer readable storage coupled to the one or more processors, the computer readable storage having stored thereon instructions that, when executed by the one or more processors, cause the one or more processors to perform operations. The operations can include sending a digital request for a remote query processor from a client computer to a remote query processor on a query server computer. The operations can further include at the remote query processor, retrieving a plurality of data stored in column sources, the plurality of data available from at least one of a low-speed memory and a high-speed memory. The operation can also include creating and storing in a high-speed computer memory separate from the low-speed computer memory in a query update graph a table object comprising a plurality of rows, the high-speed computer memory having lower access time than the low-speed computer memory. The operations can further include creating in the high-speed computer memory separate from the low-speed memory a table object index mapping data in the plurality of column sources to the table object, the high-speed memory having lower access time than the low-speed memory. The operations can also include designating in a high-speed computer memory the plurality of column sources as mapping columns having distinct data. The operations can include for each distinct datum or tuples in the mapping columns, creating a separate data index from the table object index, the separate data index pointing to a subset of the plurality of data stored in source columns, the subset associated with the distinct datum, and the subset effectively creating a subtable that can decrease processing time. The operations can include creating in the high-speed computer memory a table object listener, the table object listener configured automatically to receive by a computer signal a notification of any change to one or more rows of the table object, the high-speed memory having lower access time than the low-speed memory. The operations can further include when the table object listener receives a notification of any change of one or more rows of the table object, updating the separate data indexes created from the table object index accordingly.

The operations can include applying a grouping formula to the the plurality of data stored in source columns when creating the separate index from the table object index.

The operations can include forwarding the notification of a change to one or more rows of the table object to child nodes created by the table query operations.

The operations can include performing query operations on the separate data indexes.

The operations can include wherein the operations of the remote query processor further include returning operation results with strict ordering to guarantee ordering.

The operations can also include wherein any change to one or more rows of the table object includes at least one of a row addition, a row modification, a row deletion, and a re-indexing of the rows.

Some implementations can include a method for decreasing memory access and processing time in a computer system, the method comprising storing in a computer memory a plurality of data stored in column sources. The method can also include creating and storing in the computer memory in a query update graph a table object comprising a plurality of rows. The method can further include creating in the computer memory a table object index mapping data in the plurality of data stored in column sources to the table object. The method can also include designating in the computer memory the plurality of data stored in column sources as mapping columns having distinct data. The method can include for each distinct datum or tuples in the mapping columns, creating a separate data index from the table object index, the separate data index pointing to a subset of the plurality of data stored in source columns, the subset associated with the distinct datum, and the subset effectively creating a subtable that can decrease processing time. The method can also include using a processor to create in the computer memory a table object listener, the table object listener configured automatically to receive by a computer signal a notification of a change to one or more rows of the table object. The method can include when the table object listener receives a notification of a change one or more rows of the table object, updating the separate data indexes created from the table object index accordingly.

The method can also include applying a grouping formula to the plurality of data stored in source columns when creating the separate index from the table object index.

The method can include forwarding the notification of a change to one or more rows of the table object to child nodes created by the table query operations.

The method can also include using a processor to manipulate, with table query operations, the separate data indexes to obtain a subset of the separate data indexes.

The method can include wherein the creating and updating the separate data indexes maintain strict ordering to guarantee ordering.

The method can also include wherein any change to one or more rows of the table object includes at least one of a row addition, a row modification, a row deletion, and a re-indexing of the rows.

Some implementations can include a nontransitory computer readable medium having stored thereon software instructions that, when executed by one or more processors, cause the one or more processors to perform operations. The operations can include storing in a computer memory a plurality of data stored in column sources. The operations can further include creating and storing in the computer memory in a query update graph a table object comprising a plurality of rows. The operations can also include creating in the computer memory a table object index mapping data in the plurality of data stored in column sources to the table object. The method can include designating in the computer memory the plurality of data stored in column sources as mapping columns having distinct data. The operations can include for each distinct datum or tuples in the mapping columns, creating a separate data index from the table object index, the separate data index pointing to a subset of the plurality of data stored in source columns, the subset associated with the distinct datum, and the subset effectively creating a subtable that can decrease processing time. The operations can also include using a processor to create in the computer memory a table object listener, the table object listener configured automatically to receive by a computer signal a notification of any change to one or more rows of the table object. The operations can further include when the table object listener receives a notification of any change one or more rows of the table object, updating the separate data indexes created from the table object index accordingly.

The operations can also include applying a grouping formula to the the plurality of data stored in source columns when creating the separate index from the table object index.

The operations can also include forwarding the notification of a change to one or more rows of the table object to child nodes created by the table query operations.

The operations can include using a processor to manipulate, with table query operations, the separate data indexes to obtain a subset of the separate data indexes.

The operations can include wherein the operations further include returning operation results with strict ordering to guarantee ordering.

The operations can also include wherein any change to one or more rows of the table object includes at least one of a row addition, a row modification, a row deletion, and a re-indexing of the rows.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of an example computer data system showing an example data distribution configuration in accordance with some implementations.

FIG. 2 is a diagram of an example computer data system showing an example administration/process control arrangement in accordance with some implementations.

FIG. 3 is a diagram of an example computing device configured for table map processing in accordance with some implementations.

FIG. 4 is a diagram of an example filter operation followed by an external index mapping operation.

FIG. 5 is a diagram of an example table object creation from column sources.

FIG. 5A is a diagram of an example table object created from a base table object.

FIG. 5B is a diagram of an example table index mapping operation.

FIG. 5C is a diagram of an example table map index manipulation.

FIG. 6 is a flowchart of an example table index mapping process.

DETAILED DESCRIPTION

Reference is made herein to the Java programming language, Java classes, Java bytecode and the Java Virtual Machine (JVM) for purposes of illustrating example implementations. It will be appreciated that implementations can include other programming languages (e.g., groovy, Scala, R, Go, etc.), other programming language structures as an alternative to or in addition to Java classes (e.g., other language classes, objects, data structures, program units, code portions, script portions, etc.), other types of bytecode, object code and/or executable code, and/or other virtual machines or hardware implemented machines configured to execute a data system query.

FIG. 1 is a diagram of an example computer data system and network 100 showing an example data distribution configuration in accordance with some implementations. In particular, the system 100 includes an application host 102, a periodic data import host 104, a query server host 106, a long-term file server 108, and a user data import host 110. While tables are used as an example data object in the description below, it will be appreciated that the data system described herein can also process other data objects such as mathematical objects (e.g., a singular value decomposition of values in a given range of one or more rows and columns of a table), TableMap objects, etc. A TableMap object provides the ability to lookup a Table by some key. This key represents a unique value (or unique tuple of values) from the columns aggregated on in a byExternal( ) statement execution, for example. A TableMap object can be the result of a byExternal( ) statement executed as part of a query. It will also be appreciated that the configurations shown in FIGS. 1 and 2 are for illustration purposes and in a given implementation each data pool (or data store) may be directly attached or may be managed by a file server.

The application host 102 can include one or more application processes 112, one or more log files 114 (e.g., sequential, row-oriented log files), one or more data log tailers 116 and a multicast key-value publisher 118. The periodic data import host 104 can include a local table data server, direct or remote connection to a periodic table data store 122 (e.g., a column-oriented table data store) and a data import server 120. The query server host 106 can include a multicast key-value subscriber 126, a performance table logger 128, local table data store 130 and one or more remote query processors (132, 134) each accessing one or more respective tables (136, 138). The long-term file server 108 can include a long-term data store 140. The user data import host 110 can include a remote user table server 142 and a user table data store 144. Row-oriented log files and column-oriented table data stores are discussed herein for illustration purposes and are not intended to be limiting. It will be appreciated that log files and/or data stores may be configured in other ways. In general, any data stores discussed herein could be configured in a manner suitable for a contemplated implementation.

In operation, the input data application process 112 can be configured to receive input data from a source (e.g., a securities trading data source), apply schema-specified, generated code to format the logged data as it's being prepared for output to the log file 114 and store the received data in the sequential, row-oriented log file 114 via an optional data logging process. In some implementations, the data logging process can include a daemon, or background process task, that is configured to log raw input data received from the application process 112 to the sequential, row-oriented log files on disk and/or a shared memory queue (e.g., for sending data to the multicast publisher 118). Logging raw input data to log files can additionally serve to provide a backup copy of data that can be used in the event that downstream processing of the input data is halted or interrupted or otherwise becomes unreliable.

A data log tailer 116 can be configured to access the sequential, row-oriented log file(s) 114 to retrieve input data logged by the data logging process. In some implementations, the data log tailer 116 can be configured to perform strict byte reading and transmission (e.g., to the data import server 120). The data import server 120 can be configured to store the input data into one or more corresponding data stores such as the periodic table data store 122 in a column-oriented configuration. The periodic table data store 122 can be used to store data that is being received within a time period (e.g., a minute, an hour, a day, etc.) and which may be later processed and stored in a data store of the long-term file server 108. For example, the periodic table data store 122 can include a plurality of data servers configured to store periodic securities trading data according to one or more characteristics of the data (e.g., a data value such as security symbol, the data source such as a given trading exchange, etc.).

The data import server 120 can be configured to receive and store data into the periodic table data store 122 in such a way as to provide a consistent data presentation to other parts of the system. Providing/ensuring consistent data in this context can include, for example, recording logged data to a disk or memory, ensuring rows presented externally are available for consistent reading (e.g., to help ensure that if the system has part of a record, the system has all of the record without any errors), and preserving the order of records from a given data source. If data is presented to clients, such as a remote query processor (132, 134), then the data may be persisted in some fashion (e.g., written to disk).

The local table data server 124 can be configured to retrieve data stored in the periodic table data store 122 and provide the retrieved data to one or more remote query processors (132, 134) via an optional proxy.

The remote user table server (RUTS) 142 can include a centralized consistent data writer, as well as a data server that provides processors with consistent access to the data that it is responsible for managing. For example, users can provide input to the system by writing table data that is then consumed by query processors.

The remote query processors (132, 134) can use data from the data import server 120, local table data server 124 and/or from the long-term file server 108 to perform queries. The remote query processors (132, 134) can also receive data from the multicast key-value subscriber 126, which receives data from the multicast key-value publisher 118 in the application host 102. The performance table logger 128 can log performance information about each remote query processor and its respective queries into a local table data store 130. Further, the remote query processors can also read data from the RUTS, from local table data written by the performance logger, or from user table data read over NFS.

It will be appreciated that the configuration shown in FIG. 1 is a typical example configuration that may be somewhat idealized for illustration purposes. An actual configuration may include one or more of each server and/or host type. The hosts/servers shown in FIG. 1 (e.g., 102-110, 120, 124 and 142) may each be separate or two or more servers may be combined into one or more combined server systems. Data stores can include local/remote, shared/isolated and/or redundant. Any table data may flow through optional proxies indicated by an asterisk on certain connections to the remote query processors. Also, it will be appreciated that the term “periodic” is being used for illustration purposes and can include, but is not limited to, data that has been received within a given time period (e.g., millisecond, second, minute, hour, day, week, month, year, etc.) and which has not yet been stored to a long-term data store (e.g., 140).

FIG. 2 is a diagram of an example computer data system 200 showing an example administration/process control arrangement in accordance with some implementations. The system 200 includes a production client host 202, a controller host 204, a GUI host or workstation 206, and query server hosts 208 and 210. It will be appreciated that there may be one or more of each of 202-210 in a given implementation.

The production client host 202 can include a batch query application 212 (e.g., a query that is executed from a command line interface or the like) and a real time query data consumer process 214 (e.g., an application that connects to and listens to tables created from the execution of a separate query). The batch query application 212 and the real time query data consumer 214 can connect to a remote query dispatcher 222 and one or more remote query processors (224, 226) within the query server host 1 208.

The controller host 204 can include a persistent query controller 216 configured to connect to a remote query dispatcher 232 and one or more remote query processors 228-230. In some implementations, the persistent query controller 216 can serve as the “primary client” for persistent queries and can request remote query processors from dispatchers, and send instructions to start persistent queries. For example, a user can submit a query to 216, and 216 starts and runs the query every day. In another example, a securities trading strategy could be a persistent query. The persistent query controller can start the trading strategy query every morning before the market open, for instance. It will be appreciated that 216 can work on times other than days. In some implementations, the controller may require its own clients to request that queries be started, stopped, etc. This can be done manually, or by scheduled (e.g., cron) jobs. Some implementations can include “advanced scheduling” (e.g., auto-start/stop/restart, time-based repeat, etc.) within the controller.

The GUI/host workstation can include a user console 218 and a user query application 220. The user console 218 can be configured to connect to the persistent query controller 216. The user query application 220 can be configured to connect to one or more remote query dispatchers (e.g., 232) and one or more remote query processors (228, 230).

FIG. 3 is a diagram of an example computing device 300 in accordance with at least one implementation. The computing device 300 includes one or more processors 302, operating system 304, computer readable medium 306 and network interface 308. The memory 306 can include remote query processor application 310 and a data section 312 (e.g., for storing ASTs, precompiled code, etc.).

In operation, the processor 302 may execute the application 310 stored in the memory 306. The application 310 can include software instructions that, when executed by the processor, cause the processor to perform operations for dynamic table index mapping in accordance with the present disclosure (e.g., performing one or more of 602-610 described below).

The application program 310 can operate in conjunction with the data section 312 and the operating system 304.

In general, some implementations can include a computer data system that stores and retrieves data (e.g., time series data) according to strict ordering rules. These rules ensure that data is stored in a strict order and that results of a query are evaluated and returned in the same order each time the query is executed. This can provide an advantage of optimizing the query code for query execution speed by permitting a user and query process (e.g., a remote query processor) to rely on an expected ordering and eliminate a need for performing an additional sorting operation on query results to achieve an expected or needed ordering for downstream operations. It also allows data to be ordered according to the source's data publication order without necessarily including data elements to refer to for query evaluation or result ordering purposes. It should be noted that updates from real-time or changing data, however, may not always be seen in the same order, since data is processed after asynchronous notifications and according to refresh cycles that progress at different speed and frequency in distinct remote query processors or client processes. Updates are not necessarily the results of a query, though. For some implementations order within a partition is always maintained.

For example, in the real-time (or periodic) case, a data system may store data in arrival order (which is typically time-series order) within the partition of the table that corresponds to a given data source. In the permanent-store case (or long term storage case), the computer data system starts with the real-time order and then re-partitions, optionally groups, and optionally sorts the real-time (or periodic) data according to one or more columns or formulas, otherwise respecting the retrieval order for the real-time data when producing the new stored data and its ordering.

Some implementations can include a partitioned data store that has partitions based, at least in part, on a file system and can include physical machine partitions, virtual machine partitions and/or file system directory structure partitions. For example, partitions A, B and C of a data store (e.g., a column data source) may reside in different directories of a file system. In addition to different directories, the data store may be distributed across a plurality of data servers (physical or virtual) such that the data is partitioned to a given server and within that server, the data may be sub-partitioned to one or more directories, and within each directory, the data may be further partitioned into one or more sub-directories and/or one or more files.

Partitioning the data using a file system provides an advantage in that the location keys and retrieval instructions for storage locations of interest for potential query result data can be discovered by means of traversing a directory structure, rather than a separately-maintained location key and location retrieval information discovery service. Once discovered, locations can be narrowed from the full set of locations to a sub-set according to query instructions, which can help speed up query operations by permitting the data system to defer accessing actual data (“lazy loading”) and begin to narrow down the set of rows to evaluate without handling data (e.g., in memory and/or transmitting via a communication network). This is further enhanced by support in the data system's query engine for partitioning columns—columns of the data that are a property of all rows in any location retrieved from a given partition of the location key space, typically embodied in the name of a sub-directory when a file system is used in this way. Certain query operations can thus be executed in whole or in part against location key fields on a per-partition basis rather than against column data on a per-row basis. This may greatly improve execution performance by decreasing the input size of the calculations by several orders of magnitude.

Within a partition, data may be grouped according to a column value. The grouping may have one or more levels, with a multi-level grouping having a logical hierarchy based on the values of two or more columns, such that groups in “higher-level” columns fully-enclose groups in “lower-level” columns. Further, within a partition or group, the data can be ordered according to a given ordering scheme, e.g. strictly by the real-time recording order, or according to some sorting criteria. Grouping in this way can enhance query performance by allowing for very simple, high performance data indexing, and by increasing the physical locality of related data, which in turn can reduce the number of rows or blocks that must be evaluated, and/or allow for extremely performant data caching and pre-fetching, with high cache hit ratios achieved with smaller cache sizes than some other data systems.

For example, securities trading data may be partitioned across servers by a formula that takes ticker symbol as input. Within each server, the data may be partitioned by a directory corresponding to trade data date. Within each date partition directory, data may be in a file grouped by one or more ticker symbol values. Within each ticker symbol group, the data may be ordered by time.

In another example, when generating a query result table, the data system can first focus on a server (or servers) for the symbol (or symbols) being accessed, then one or more partitions for the date(s) of interest, then one or more files and group(s) within the file(s) before any data is actually accessed or moved. Once the data system resolves the actual data responsive to the query, the data (or references to the data in one or more data sources) can be retrieved and stored into a query result table according to a strict ordering and will be evaluated and returned in that same order each time the query is executed.

It will be appreciated that some data stores or tables can include data that may be partitioned, grouped, and/or ordered. For example, some data may be partitioned and ordered, but not grouped (e.g., periodic data such as intraday trading data). Other data may be partitioned, grouped and ordered (e.g., long-term storage data such as historical trading data). Also it will be appreciated that any individual table, partition or group can be ordered. Partitions can be grouped according to a grouping and/or ordering specific to each partition.

Large data systems can be dynamic in nature with continuing steams of data being added by the second or even the microsecond. Tables can become quite large and cumbersome to query. A system's processor and memory use can benefit from splitting a large table source into smaller index mappings of the larger table source. To relieve the system from constantly re-performing queries against a large data source, the large data source can be mapped into smaller indexed data of interest.

FIG. 4 is a diagram of an example filter operation followed by an external table index mapping. A table A object 400 can be created by designating data columns and a data source for populating the columns. For example, the data columns can be created as a symbol column, a date column, a time column and a quote column. The data source can be located in a data storage area 404. The data storage area 404 can contain the column sources (406, 408, 410, 412) for populating the table A object 400 columns. For example, the data storage area 404 can contain a symbol column source 406, a date column source 408, a time column source 410, and a quote column source 412. A table A index 402 can be created and mapped to the column sources (406, 408, 410, 412). For example, a table index can describe which section of the column source are part of the table, as well as the positions of the column source within the table.

Filtering operations can be performed on the table A object 400. For example, a table B object 416 can be formed by selecting rows in table A object where the symbol is “AAPL” or “CMI” 414. A table B object index 418 can be created and mapped to the table A object column sources (406, 408, 410, 412) for the “AAPL” and “CMI” rows.

It will be appreciated that a column source can be maintained as an array of data. Because an array is naturally an index structure, a separate structure may not need to be added to a column source when the column source is kept in an array. A column source maintained as an array can also guarantee an ordering of the data because the ordering can be maintained by the array index structure.

A ByExternal mapping by symbol process 420 can be performed on the table B object 416. The ByExternal mapping by symbol process 420 can create a table mapping 422 that can include a separate subset of the table B object index for symbol AAPL 424 and a separate subset of table B object index for symbol CMI 426.

FIG. 5 is a diagram of an example table A object creation from column sources. For example, each of the column sources (500, 502, 504, 506) can act as a dictionary that can map integers (#) to a value (data). The row integers (#s) can be matched across the four column sources (500, 502, 504, 506) to form a row of data. For example, row #3 across the column sources (500, 502, 504, 506) can create a row that contains “AAPL, 2/17/16, 9:32, $100.31.”

A create table A object process or command 508 can be used to map the table A object rows to all the data found across column source 1 500, column source 2 502, column source 3 504, and column source 4 506. Table A can contain an index 520 that can be a mapping structure, which can contain valid row addresses from its constituent column sources (500, 502, 504, 506).

The table A index 520 can contain index #s 522 that can correspond to the same column source row #s 524 to create all of the table A object rows as shown in a table A displayed content 510. The table A displayed content 510 can be displayed on a graphical user interface (GUI). The table A object display content 510 can include column 1 512 integers (#) that can be mapped to the symbol column source 406, column 2 514 integers (#) that can be mapped to the date column source 408, column 3 516 integers (#) that can be mapped to the time column source 410, and column 4 518 integers (#) that can be mapped to the quote column source 412 by using the table A index 520 index integers (#s) 522 to all of the column sources 524 integers (#). Column sources 524 CS1 integers (#) maps to symbol column source 406, CS2 integers (#) to date column source 408, CS3 integers (#) to time column source 410, and CS4 integers (#) to quote column source 412. Mapping between a column name and a column source can be contained in a column source map (not shown).

It will be appreciated that a table object can have numerous column sources and is not limited to the column sources of the example. It will also be appreciated that the table A object 508 example created a base table object that can include all of the data found in the designated column sources. After a base table such as a table A object 508 is created, the base table can be transformed to be indexed to a subset of row #s found in the column sources.

It will also be appreciated that all of the integers do not always have to be stored. For example, a range of integers with associated values can be stored without explicitly storing each integer and value.

FIG. 5A is a diagram of an example table object created from a base table object. For example, a table B object can be created by selecting rows from a table A object where the Symbol=AAPL or CMI 530. A separate index can be created for the table B object to map the table B object to a subset of the data in the column sources 542. The index #s 544 for the table B index 542 can be a subset of the index #s 522 for the table A index. For example, the index #s 522 for the table A index can contain values from 0 through 100 without any gaps because the table A index is mapped to the entire data in the column sources 524. But because the table B object has only been mapped to the AAPL and CMI symbols, the index #s for SPY, index # value 2 in index # column 544 and index # value 100 in index # column 524, can be removed from index # column 544. The content that would be displayed for Table B 532 in a GUI can contain the column source 546 data mapped to the index #s 544 in the table B index 542. The table B object display can include the AAPL and CMI column 1 534 that can be mapped to the symbol column source 406 for AAPL and CMI values, column 2 536 that can be mapped to the date column source 408 for the associated AAPL and CMI dates, column 3 538 that can be mapped to the time column source 410 for the associated AAPL and CMI times, and column 4 540 that can be mapped to the quote column source 412 for the associated AAPL and CMI quotes because the table B index 542 contains index #s 544 to only the column source 546 indexes that contain AAPL and CMI.

FIG. 5B is a diagram of an example table index mapping operation. For example, the table B object from FIG. 5A can be mapped into table map indexes per symbol 552 by executing a ByExternal (“Symbol”) command 550 with the table B index to column sources 542. The table B index 542 can contain index #s 544, which can be matched with the column sources 546 cs1 #, cs2 #, cs3 #, and cs4 #. The ByExternal (“Symbol”) command 550 can operate on the table B index to column sources 542 to extract a separate index for each unique symbol value found in the symbol column 1 534. In the FIG. 5A example above, the table B index was filtered to contain only the symbols AAPL and CMI. Accordingly, when the ByExternal (“Symbol”) command 550 is applied to the table B index, a separate AAPL index 554 and a separate CMI index 556 can be created because AAPL and CMI are the unique symbol values found in the table B index.

Continuing the example, in the separate table map indexes per symbol 552, the AAPL index 554 can contain only index #s that match the table B index 542 for the symbol AAPL, which in this example are index #s 544 (0, 3, 98) for AAPL. AAPL subtable displayed content 555 is an example of the content that can be displayed for a separate AAPL index 554 in a GUI. For the separate table map indexes per symbol 552 for CMI, the CMI index 556 can contain only index #s that match the table B index 542 for the CMI symbol, which in this example are index #s 544 (1, 4, 99) for CMI.

It will be appreciated that the syntax of the ByExternal command 550 is not limiting and only provided as an example function name and syntax. The underlying function or process called by the ByExternal command 550 can be named according to other language constructs and mnemonic creativity.

It will also be appreciated that the ByExternal command 550 can be applied to a table that has not been filtered, for example, the table A object in FIG. 5. The ByExternal command 550 can also be to applied to tables modified or created by joins and any other valid table-based operation.

It will further be appreciated that a ByExternal command 550 can contain one or more grouping columns.

FIG. 5C is a diagram of an example table map index manipulation. In the FIG. 5B example, separate map indexes were created for the AAPL and CMI symbols. Table map indexes such as table map indexes per symbol 552 can be manipulated with normal object table or table operations such as where clause filters, joins, other functions that combine data, and the like, in order to further focus on a smaller set of data and decrease the index size, which can lead to benefits in data access efficiency through smaller indexes. For example, a where clause can be executed to filter the table map indexes per symbol 552 to create separate symbol indexes for quotes greater than $100.00 560. The example results can be table map indexes for each symbol with quotes greater than $100 562. For example, when the table map indexes per symbol 552 are filtered for rows containing a quote greater than $100, the resulting table map indexes for quotes greater than $100 562 can be an AAPL index 564 and a CMI index 566. For example, AAPL index 564 can contain index #3 because AAPL index 554 #3 maps to the column source 1 500 #3 that has a data value of AAPL and to the column source 4 506 #3 that has a data value of $100.31. Continuing the example, CMI index 566 can contain index #4 because CMI index #4 maps to the column source 1 500 #4 that has a data value of CMI and to the column source 4 506 #4 that has a data value of $100.03. For example, when displayed in a GUI, a user can see subtable displayed content 570 that can contain AAPL subtable 572 and CMI subtable 574.

It will be appreciated that smaller indexes created from a large index can aid in the parallelization of query operation across multiple processors. Also, a byExternal command can be used to divide a large table into many different index blocks, which can each be processed on a rolling manner, for example, each block processed every 5 minutes at a 5 second offset from each another. Processing on a rolling manner permits all the data to be processed over the course of a chosen time period, but not all at once so that the performance/load burdens on the system are more evenly distributed over time.

FIG. 6 is a flowchart of an example table index mapping process 600. Processing begins at 602, when a table A object is created with an index to column source data for populating the table A object. Processing continues to 604.

At 604, a command similar to TABLE_MAP=TABLE_A.byExternal (“[column name 1, . . . column name n]”) is executed to create separate TABLE_MAP indexes that map to column source rows for each each distinct column 1-column n tuple combination found in the table A object index.

It will be appreciated that a byExternal command is not limited to one column name and can accept multiple column names as arguments. When multiple column names are provided, the byExternal command can group the resulting mapping by tuples formed from the values in all of the provided multiple columns.

For example, a first column source can exist for “car manufacturers,” a second column source can exist for “make,” a third column source can exist for “model,” and a fourth column source can exist for “year built.” The car manufacturers column source can have hundreds of row values for “Ford,” “Chevrolet,” and “Fiat.” Each row receives its own index #, for example starting with 0 through the number of rows minus one for the column source. And each of the make, model, and year built column sources can have the same index # for associated rows. Table objects can be mapped to the entirety of the column source content or can be a subset of column source content conditioned on a filtering statement such as a where clause, a sorting clause, or the like. The table A object example was created as a full table object without a filter clause and accordingly, contains a full set of column source data.

Continuing the example, when Table_Map=Table_A.byExternal (“car manufacturers”) is executed, a Table_Map is created that contains a separate index for all Ford rows across all column sources with matching Ford index numbers, a separate index for all Chevrolet rows across all column sources with matching Chevrolet index numbers, and a separate index for all Fiat rows across all column sources with matching Fiat index numbers. Queries can now access an index specific to a single car manufacturer to increase efficiency in providing results specific to a particular car manufacturer. Logically, the byExternal command in this example has created a map containing one table index for each manufacturer.

Continuing the example, a table A index modification listener for the Table_Map is also created when Table_Map=Table_A.byExternal (“car manufacturers”) is executed. Table index modification listeners such as a table A index modification listener can be a software construct associated with a changing data source that can listen for events or changes that can occur in a changing data source or an index to a source. Examples of events or changes can include an addition of one or more rows to a table, a modification of one or more rows of a table, a deletion of one or more rows from a table, a re-indexing of table rows, and associated index changes.

It will be appreciated that the ByExternal command can include grouping by formula columns. For example, tm=t·byExternal (“Symbol”, “A>10”). In this example, Symbol can be a normal column used for grouping and “A>10” can be a formula used for grouping. In this example, the tuple for executing byExternal would be (<symbol>, <true|false>).

It will also be appreciated that table A can have one modification listener. A remote query processor can remove, add, or modify rows to each of the table map indexes based on index updates to table A and new and previous values of the table map indexes. Each of the table map indexes can contain a node in a remote query processor update query graph that can produce an appropriate index notification. If the table map index nodes have downstream modification listeners, the downstream listeners can also be notified to update the associated downstream child nodes. Processing continues to 606.

At 606, The TABLE_MAP table A index modification listener listens for changes to the table A object index that occur when adds, modifications, deletions, re-indexing, or other changes occur in the table A object. In a real-time data processing environment when hundreds or thousands of rows are being added to a table every second, the associated indexes can also be updated to keep query results accurate. Processing continues to 608.

At 608, If the TABLE_MAP table A index modification listener determines that one or more rows have been added, deleted, modified or other changes such as re-indexing have occurred in the table A object or the table A index, changes are made to the TABLE_MAP indexes to keep the TABLE_MAP indexes in synchronization with the table A index. In continuing the car manufacturer example, if a new row for Ford is added with a new make, model, and built year, the index modification listener can detect that addition and cause the table_map to add a new row # and the associated column source index #s to the table_map index for Ford. Modification listeners to the ford table_map index would also receive notification, but listeners to the Chevrolet and Fiat table_map indexes would not receive the change notifications. Accordingly, the table_map indexes for Chevrolet and Fiat would not be effected.

It will be appreciated that if a new distinct column name value is added, the listener would identify the addition and the TABLE_MAP would create a new separate index mapping for that value when a supporting separate index is not found. For example, if Porsche is added as a new car manufacturer to the car manufacturer column because Porsche was added to the first column source, the Table_Map would not have a separate index for Porsche. The listener would detect the addition of the Porsche row and the Table_Map would create a new map index for the Porsche car manufacturer.

It will be appreciated that a modification listener can listen to a Table_Map in order to receive notifications of new table mapping indexes.

It will also be appreciated that in place of deleting a table, all table entries can be removed from the table and the table allowed to remain as an empty table.

It will further be appreciated that the invention is not limited to car manufacturer data or stock market data. Processing continues to 610.

At 610, change notifications are sent to any children nodes that may have been created through any table query operations on the TABLE_MAP indexes. Processing returns back to 606.

It will be appreciated that the modules, processes, systems, and sections described above can be implemented in hardware, hardware programmed by software, software instructions stored on a nontransitory computer readable medium or a combination of the above. A system as described above, for example, can include a processor configured to execute a sequence of programmed instructions stored on a nontransitory computer readable medium. For example, the processor can include, but not be limited to, a personal computer or workstation or other such computing system that includes a processor, microprocessor, microcontroller device, or is comprised of control logic including integrated circuits such as, for example, an Application Specific Integrated Circuit (ASIC), a field programmable gate array (FPGA), graphics processing unit (GPU), or the like. The instructions can be compiled from source code instructions provided in accordance with a programming language such as Java, C, C++, C#.net, assembly or the like. The instructions can also comprise code and data objects provided in accordance with, for example, the Visual Basic™ language, a specialized database query language, or another structured or object-oriented programming language. The sequence of programmed instructions, or programmable logic device configuration software, and data associated therewith can be stored in a nontransitory computer-readable medium such as a computer memory or storage device which may be any suitable memory apparatus, such as, but not limited to ROM, PROM, EEPROM, RAM, flash memory, disk drive and the like.

Furthermore, the modules, processes systems, and sections can be implemented as a single processor or as a distributed processor. Further, it should be appreciated that the steps mentioned above may be performed on a single or distributed processor (single and/or multi-core, or cloud computing system). Also, the processes, system components, modules, and sub-modules described in the various figures of and for embodiments above may be distributed across multiple computers or systems or may be co-located in a single processor or system. Example structural embodiment alternatives suitable for implementing the modules, sections, systems, means, or processes described herein are provided below.

The modules, processors or systems described above can be implemented as a programmed general purpose computer, an electronic device programmed with microcode, a hard-wired analog logic circuit, software stored on a computer-readable medium or signal, an optical computing device, a networked system of electronic and/or optical devices, a special purpose computing device, an integrated circuit device, a semiconductor chip, and/or a software module or object stored on a computer-readable medium or signal, for example.

Embodiments of the method and system (or their sub-components or modules), may be implemented on a general-purpose computer, a special-purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit element, an ASIC or other integrated circuit, a digital signal processor, a hardwired electronic or logic circuit such as a discrete element circuit, a programmed logic circuit such as a PLD, PLA, FPGA, PAL, or the like. In general, any processor capable of implementing the functions or steps described herein can be used to implement embodiments of the method, system, or a computer program product (software program stored on a nontransitory computer readable medium).

Furthermore, embodiments of the disclosed method, system, and computer program product (or software instructions stored on a nontransitory computer readable medium) may be readily implemented, fully or partially, in software using, for example, object or object-oriented software development environments that provide portable source code that can be used on a variety of computer platforms. Alternatively, embodiments of the disclosed method, system, and computer program product can be implemented partially or fully in hardware using, for example, standard logic circuits or a VLSI design. Other hardware or software can be used to implement embodiments depending on the speed and/or efficiency requirements of the systems, the particular function, and/or particular software or hardware system, microprocessor, or microcomputer being utilized. Embodiments of the method, system, and computer program product can be implemented in hardware and/or software using any known or later developed systems or structures, devices and/or software by those of ordinary skill in the applicable art from the function description provided herein and with a general basic knowledge of the software engineering and computer networking arts.

Moreover, embodiments of the disclosed method, system, and computer readable media (or computer program product) can be implemented in software executed on a programmed general purpose computer, a special purpose computer, a microprocessor, or the like.

It is, therefore, apparent that there is provided, in accordance with the various embodiments disclosed herein, methods, systems and computer readable media for table index mapping.

Application Ser. No. 15/154,974, entitled “DATA PARTITIONING AND ORDERING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,975, entitled “COMPUTER DATA SYSTEM DATA SOURCE REFRESHING USING AN UPDATE PROPAGATION GRAPH” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,979, entitled “COMPUTER DATA SYSTEM POSITION-INDEX MAPPING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,980, entitled “SYSTEM PERFORMANCE LOGGING OF COMPLEX REMOTE QUERY PROCESSOR QUERY OPERATIONS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,983, entitled “DISTRIBUTED AND OPTIMIZED GARBAGE COLLECTION OF REMOTE AND EXPORTED TABLE HANDLE LINKS TO UPDATE PROPAGATION GRAPH NODES” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,984, entitled “COMPUTER DATA SYSTEM CURRENT ROW POSITION QUERY LANGUAGE CONSTRUCT AND ARRAY PROCESSING QUERY LANGUAGE CONSTRUCTS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,985, entitled “PARSING AND COMPILING DATA SYSTEM QUERIES” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,987, entitled “DYNAMIC FILTER PROCESSING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,988, entitled “DYNAMIC JOIN PROCESSING USING REAL-TIME MERGED NOTIFICATION LISTENER” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,990, entitled “DYNAMIC TABLE INDEX MAPPING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,991, entitled “QUERY TASK PROCESSING BASED ON MEMORY ALLOCATION AND PERFORMANCE CRITERIA” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,993, entitled “A MEMORY-EFFICIENT COMPUTER SYSTEM FOR DYNAMIC UPDATING OF JOIN PROCESSING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,995, entitled “QUERY DISPATCH AND EXECUTION ARCHITECTURE” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,996, entitled “COMPUTER DATA DISTRIBUTION ARCHITECTURE” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,997, entitled “DYNAMIC UPDATING OF QUERY RESULT DISPLAYS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,998, entitled “DYNAMIC CODE LOADING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/154,999, entitled “IMPORTATION, PRESENTATION, AND PERSISTENT STORAGE OF DATA” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,001, entitled “COMPUTER DATA DISTRIBUTION ARCHITECTURE” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,005, entitled “PERSISTENT QUERY DISPATCH AND EXECUTION ARCHITECTURE” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,006, entitled “SINGLE INPUT GRAPHICAL USER INTERFACE CONTROL ELEMENT AND METHOD” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,007, entitled “GRAPHICAL USER INTERFACE DISPLAY EFFECTS FOR A COMPUTER DISPLAY SCREEN” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,009, entitled “COMPUTER ASSISTED COMPLETION OF HYPERLINK COMMAND SEGMENTS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,010, entitled “HISTORICAL DATA REPLAY UTILIZING A COMPUTER SYSTEM” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,011, entitled “DATA STORE ACCESS PERMISSION SYSTEM WITH INTERLEAVED APPLICATION OF DEFERRED ACCESS CONTROL FILTERS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

Application Ser. No. 15/155,012, entitled “REMOTE DATA OBJECT PUBLISHING/SUBSCRIBING SYSTEM HAVING A MULTICAST KEY-VALUE PROTOCOL” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.

While the disclosed subject matter has been described in conjunction with a number of embodiments, it is evident that many alternatives, modifications and variations would be, or are, apparent to those of ordinary skill in the applicable arts. Accordingly, Applicants intend to embrace all such alternatives, modifications, equivalents and variations that are within the spirit and scope of the disclosed subject matter. 

What is claimed is:
 1. A computer system for decreasing memory access and processing time in a computer system, the system comprising: one or more processors; computer readable storage coupled to the one or more processors, the computer readable storage having stored thereon instructions that, when executed by the one or more processors, cause the one or more processors to perform operations including: sending a digital request for a remote query processor from a client computer to a remote query processor on a query server computer; at the remote query processor, performing operations including: retrieving a plurality of data stored in column sources, the plurality of data available from at least one of a low-speed memory and a high-speed memory; creating and storing in a high-speed computer memory separate from the low-speed computer memory in a query update graph a table object comprising a plurality of rows, the high-speed computer memory having lower access time than the low-speed computer memory; creating in the high-speed computer memory separate from the low-speed memory a table object index mapping data in the plurality of column sources to the table object, the high-speed memory having lower access time than the low-speed memory; designating in a high-speed computer memory the plurality of column sources as mapping columns having distinct data; for each distinct datum or tuples in the mapping columns, creating a separate data index from the table object index, the separate data index pointing to a subset of the plurality of data stored in source columns, the subset associated with the distinct datum, and the subset effectively creating a subtable that can decrease processing time; creating in the high-speed computer memory a table object listener, the table object listener configured automatically to receive by a computer signal a notification of any change to one or more rows of the table object, the high-speed memory having lower access time than the low-speed memory; and when the table object listener receives a notification of any change of one or more rows of the table object, updating the separate data indexes created from the table object index accordingly.
 2. The computer system of claim 1, further comprising applying a grouping formula to the plurality of data stored in source columns when creating the separate index from the table object index.
 3. The computer system of claim 1, further comprising forwarding the notification of a change to one or more rows of the table object to child nodes created by the table query operations.
 4. The computer system of claim 1, further comprising performing query operations on the separate data indexes.
 5. The computer system of claim 1, wherein the operations of the remote query processor further include returning operation results with strict ordering to guarantee ordering.
 6. The computer system of claim 1, wherein any change to one or more rows of the table object includes at least one of a row addition, a row modification, a row deletion, and a re-indexing of the rows.
 7. A method for decreasing memory access and processing time in a computer system, the method comprising: storing in a computer memory a plurality of data stored in column sources; creating and storing in the computer memory in a query update graph a table object comprising a plurality of rows; creating in the computer memory a table object index mapping data in the plurality of data stored in column sources to the table object; designating in the computer memory the plurality of data stored in column sources as mapping columns having distinct data; for each distinct datum or tuples in the mapping columns, creating a separate data index from the table object index, the separate data index pointing to a subset of the plurality of data stored in source columns, the subset associated with the distinct datum, and the subset effectively creating a subtable that can decrease processing time; using a processor to create in the computer memory a table object listener, the table object listener configured automatically to receive by a computer signal a notification of a change to one or more rows of the table object; and when the table object listener receives a notification of a change one or more rows of the table object, updating the separate data indexes created from the table object index accordingly.
 8. The method of claim 7, further comprising applying a grouping formula to the plurality of data stored in source columns when creating the separate index from the table object index.
 9. The method of claim 7, further comprising forwarding the notification of a change to one or more rows of the table object to child nodes created by the table query operations.
 10. The method of claim 7, further comprising using a processor to manipulate, with table query operations, the separate data indexes to obtain a subset of the separate data indexes.
 11. The method of claim 7, wherein the creating and updating the separate data indexes maintain strict ordering to guarantee ordering.
 12. The method of claim 7, wherein any change to one or more rows of the table object includes at least a re-indexing of the rows.
 13. A nontransitory computer readable medium having stored thereon software instructions that, when executed by one or more processors, cause the one or more processors to perform operations including: storing in a computer memory a plurality of data stored in column sources; creating and storing in the computer memory in a query update graph a table object comprising a plurality of rows; creating in the computer memory a table object index mapping data in the plurality of data stored in column sources to the table object; designating in the computer memory the plurality of data stored in column sources as mapping columns having distinct data; for each distinct datum or tuples in the mapping columns, creating a separate data index from the table object index, the separate data index pointing to a subset of the plurality of data stored in source columns, the subset associated with the distinct datum, and the subset effectively creating a subtable that can decrease processing time; using a processor to create in the computer memory a table object listener, the table object listener configured automatically to receive by a computer signal a notification of any change to one or more rows of the table object; and when the table object listener receives a notification of any change one or more rows of the table object, updating the separate data indexes created from the table object index accordingly.
 14. The nontransitory computer readable medium of claim 13, further comprising applying a grouping formula to the plurality of data stored in source columns when creating the separate index from the table object index.
 15. The nontransitory computer readable medium of claim 13, further comprising forwarding the notification of a change to one or more rows of the table object to child nodes created by the table query operations.
 16. The nontransitory computer readable medium of claim 13, further comprising using a processor to manipulate, with table query operations, the separate data indexes to obtain a subset of the separate data indexes.
 17. The nontransitory computer readable medium of claim 13, wherein the operations further include returning operation results with strict ordering to guarantee ordering.
 18. The nontransitory computer readable medium of claim 13, wherein any change to one or more rows of the table object includes at least a re-indexing of the rows. 